Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
نویسندگان
چکیده
منابع مشابه
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
We study the parameterized complexity of the directed variant of the classical Steiner Tree problem on various classes of directed sparse graphs. While the parameterized complexity of Steiner Tree parameterized by the number of terminals is well understood, not much is known about the parameterization by the number of non-terminals in the solution tree. All that is known for this parameterizati...
متن کاملOn subexponential parameterized algorithms for Steiner Tree and Directed Subset TSP on planar graphs
There are numerous examples of the so-called “square root phenomenon” in the field of parameterized algorithms: many of the most fundamental graph problems, parameterized by some natural parameter k, become significantly simpler when restricted to planar graphs and in particular the best possible running time is exponential in O( √ k) instead of O(k) (modulo standard complexity assumptions). We...
متن کاملSubexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
The well-known bidimensionality theory provides a method for designing fast, subexponentialtime parameterized algorithms for a vast number of NP-hard problems on sparse graph classes such as planar graphs, bounded genus graphs, or, more generally, graphs with a fixed excluded minor. However, in order to apply the bidimensionality framework the considered problem needs to fulfill a special densi...
متن کاملParameterized Complexity of Arc-Weighted Directed Steiner Problems
We start a systematic parameterized computational complexity study of three NP-hard network design problems on arc-weighted directed graphs: directed Steiner tree, strongly connected Steiner subgraph, and directed Steiner network. We investigate their parameterized complexities with respect to the three parameterizations: “number of terminals,” “an upper bound on the size of the connecting netw...
متن کاملParameterized complexity of the induced subgraph problem in directed graphs
In this Letter, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D have an induced subdigraph on k vertices with property P? We completely characterize hereditary properties for which this induced subgraph problem is W [1]-complete for two classes of directed graphs: general directed g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2017
ISSN: 0895-4801,1095-7146
DOI: 10.1137/15m103618x